23 research outputs found
TOFEC: Achieving Optimal Throughput-Delay Trade-off of Cloud Storage Using Erasure Codes
Our paper presents solutions using erasure coding, parallel connections to
storage cloud and limited chunking (i.e., dividing the object into a few
smaller segments) together to significantly improve the delay performance of
uploading and downloading data in and out of cloud storage.
TOFEC is a strategy that helps front-end proxy adapt to level of workload by
treating scalable cloud storage (e.g. Amazon S3) as a shared resource requiring
admission control. Under light workloads, TOFEC creates more smaller chunks and
uses more parallel connections per file, minimizing service delay. Under heavy
workloads, TOFEC automatically reduces the level of chunking (fewer chunks with
increased size) and uses fewer parallel connections to reduce overhead,
resulting in higher throughput and preventing queueing delay. Our trace-driven
simulation results show that TOFEC's adaptation mechanism converges to an
appropriate code that provides the optimal delay-throughput trade-off without
reducing system capacity. Compared to a non-adaptive strategy optimized for
throughput, TOFEC delivers 2.5x lower latency under light workloads; compared
to a non-adaptive strategy optimized for latency, TOFEC can scale to support
over 3x as many requests
On Diagnosis of Forwarding Plane via Static Forwarding Rules in Software Defined Networks
Software Defined Networks (SDN) decouple the forwarding and control planes
from each other. The control plane is assumed to have a global knowledge of the
underlying physical and/or logical network topology so that it can monitor,
abstract and control the forwarding plane. In our paper, we present solutions
that install an optimal or near-optimal (i.e., within 14% of the optimal)
number of static forwarding rules on switches/routers so that any controller
can verify the topology connectivity and detect/locate link failures at data
plane speeds without relying on state updates from other controllers. Our upper
bounds on performance indicate that sub-second link failure localization is
possible even at data-center scale networks. For networks with hundreds or few
thousand links, tens of milliseconds of latency is achievable.Comment: Submitted to Infocom'14, 9 page
Network Layer Support for Service Discovery in Mobile Ad Hoc Networks
Service discovery is an integral part of the ad hoc networking toachieve stand-alone and self-configurable communication networks. Inthis paper, we discuss possible service discovery architectures alongwith the required network support for their implementation, and wepropose a distributed service discovery architecture which relies on avirtual backbone for locating and registering available serviceswithin a dynamic network topology. Our proposal consists of twoindependent components: (i) formation of a virtual backbone and (ii)distribution of service registrations, requests, and replies. Thefirst component creates a mesh structure from a subset of a givennetwork graph that includes the nodes acting as service brokers and asubset of paths (which we refer as virtual links) connectingthem. Service broker nodes (SBNs) constitute a dominating set, i.e.all the nodes in the network are either in this set or only one-hopaway from at least one member of the set. The second componentestablishes sub-trees rooted at service requesting nodes andregistering servers for efficient dissemination of the servicediscovery probing messages. Extensive simulation results are providedfor comparison of performance measures ,i.e. latency, success rate,and control message overhead, when different architectures and networksupport mechanisms are utilized in service discovery
A Framework for Cross-layer Design of Energy-efficient Communication with QoS Provisioning in Multi-hop Wireless Networks
Efficient use of energy while providing an adequate level of connection to individual sessions is of paramount importance in multi-hop wireless networks. Energy efficiency and connection quality depend on mechanisms that span several communication layers due to the existing co-channel interference among competing flows that must reuse the limited radio spectrum. Although independent consideration of these layers simplifies the system design, it is often insufficient for wireless networks when the overall system performance is examined carefully. The multi-hop wireless extensions and the need for routing users' sessions from source to the destination only intensify this point of view. In this work, we present a framework for cross-layer design towards energy-efficient communication. Our approach is characterized by a synergy between the physical and the medium access control (MAC) layers with a view towards inclusion of higher layers as well. More specifically, we address the joint problem of power control and scheduling with the objective of minimizing the total transmit power subject to the end-to-end quality of service (QoS) guarantees for sessions in terms of their bandwidth and bit error rate guarantees. Bearing to the NP-hardness of this combinatorial optimization problem, we propose our heuristic solutions that follow greedy approaches
Proactive seeding for information cascades in cellular networks
Abstract—Online social networks (OSNs) play an increasingly important role today in informing users about content. At the same time, mobile devices provide ubiquitous access to this content through the cellular infrastructure. In this paper, we exploit the fact that the interest in content spreads over OSNs, which makes it, to a certain extent, predictable. We propose Proactive Seeding– a technique for minimizing the peak load of cellular networks, by proactively pushing (“seeding”) content to selected users before they actually request it. We develop a family of algorithms that take as input information primarily about (i) cascades on the OSN and possibly about (ii) the background traffic load in the cellular network and (iii) the local connectivity among mobiles; the algorithms then select which nodes to seed and when. We prove that Proactive Seeding is optimal when the prediction of information cascades is perfect. In realistic simulations, driven by traces from Twitter and cellular networks, we find that Proactive Seeding reduces the peak cellular load by 20%-50%. Finally, we combine Proactive Seeding with techniques that exploit local mobile-to-mobile connections to further reduce the peak load. I
Dynamic Code Assignment and Spreading Gain Adaptation in Synchronous CDMA Wireless Networks
DS-CDMA has been recognized as the major candidate for providing high and variable data rates in third generation wireless networks, where multi-code structures and different spreading gains will be employed. In this paper, we address the problem of assignment of variable spreading gain deterministic codes to a set of users, with the objective to maximize down-link system throughput. We propose an algorithm to allocate codes to users with different minimum rate requirements, based on code cross-correlation properties and spreading gains. Our algorithm first constructs an admissible set of codes by using criteria which are based on induced interference to the system and code rates. These codes are then appropriately assigned to users, so that user rate requirements are satisfied. Comparative numerical results for different performance measures of these criteria are also provided
When Queueing Meets Coding: Optimal-Latency Data Retrieving Scheme in Storage Clouds
In this paper, we study the problem of reducing the delay of downloading data
from cloud storage systems by leveraging multiple parallel threads, assuming
that the data has been encoded and stored in the clouds using fixed rate
forward error correction (FEC) codes with parameters (n, k). That is, each file
is divided into k equal-sized chunks, which are then expanded into n chunks
such that any k chunks out of the n are sufficient to successfully restore the
original file. The model can be depicted as a multiple-server queue with
arrivals of data retrieving requests and a server corresponding to a thread.
However, this is not a typical queueing model because a server can terminate
its operation, depending on when other servers complete their service (due to
the redundancy that is spread across the threads). Hence, to the best of our
knowledge, the analysis of this queueing model remains quite uncharted.
Recent traces from Amazon S3 show that the time to retrieve a fixed size
chunk is random and can be approximated as a constant delay plus an i.i.d.
exponentially distributed random variable. For the tractability of the
theoretical analysis, we assume that the chunk downloading time is i.i.d.
exponentially distributed. Under this assumption, we show that any
work-conserving scheme is delay-optimal among all on-line scheduling schemes
when k = 1. When k > 1, we find that a simple greedy scheme, which allocates
all available threads to the head of line request, is delay optimal among all
on-line scheduling schemes. We also provide some numerical results that point
to the limitations of the exponential assumption, and suggest further research
directions.Comment: Original accepted by IEEE Infocom 2014, 9 pages. Some statements in
the Infocom paper are correcte
Building reliable storage clouds: models, fundamental tradeoffs, and solutions
Building Reliable Storage Clouds presents various distributed storage systems, their operational characteristics, and the key techniques to improve their performance